Monadic second-order model-checking on decomposable matroids
نویسندگان
چکیده
منابع مشابه
Monadic second-order model-checking on decomposable matroids
A notion of branch-width may be defined for matroids, which generalizes the one known for graphs. We first give a proof of the polynomial time model checking of MSOM on representable matroids of bounded branch-width, by reduction to MSO on trees, much simpler than the one previously known. We deduce results about spectrum of MSOM formulas and enumeration on matroids of bounded branch-width. We ...
متن کاملAutomata for Monadic Second-Order Model-Checking
We describe the construction of finite automata on terms establishing that the model-checking problem for every monadic second-order graph property is fixed-parameter linear for tree-width and clique-width (Chapter 6 of [6]). In this approach, input graphs of small tree-width and clique-width are denoted by terms over finite signatures. These terms reflect the corresponding hierarchical decompo...
متن کاملMonadic Second-Order Evaluations on Tree-Decomposable Graphs
Every graph generated by a hyperedge replacement graph-grammar can be represented by a tree, namely the derivation tree of the derivation sequence that produced it. Certain functions on graphs can be computed recursively on the derivation trees of these graphs. By using monadic second-order logic and semiring homomorphisms, we describe in a single formalism a large class of such functions. Poly...
متن کاملOn the model-checking of monadic second-order formulas with edge set quantifications
We extend clique-width to graphswithmultiple edges. We obtain fixed-parameter tractable model-checking algorithms for certain monadic second-order graph properties that depend on the multiplicities of edges, with respect to this ‘‘new’’ clique-width. We define special tree-width, the variant of tree-width relative to tree-decompositions such that the boxes that contain a vertex are on a path or...
متن کاملSpace and circuit complexity of monadic second-order definable problemes on tree-decomposable structures
A famous theorem of Courcelle states that every problem that is definable in monadic second-order (mso) logic can be solved in linear time on input structures of bounded tree width. While Courcelle’s result is optimal from the algorithmic point of view, this thesis shows how to solve monadic secondorder definable decision, counting, and optimization problems on tree-widthbounded structures opti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.02.005